Array grammar normal forms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On context-free parallel communicating grammar systems: synchronization, communication, and normal forms

In this paper we study the generative power of context-free returning parallel communicating grammar systems using diierent synchronization mechanisms and communication protocols. We demonstrate the equivalence of several types of these systems and present normal form theorems showing that all languages generated by context-free returning parallel communicating grammar systems can also be gener...

متن کامل

Derivation Complexity in Context-Free Grammar Forms

Let F be an arbitrary context-free grammar form and (F) the family of grammars defined by F. For each grammar G in d(F), the derivation complexity function 6, on the language of G, is defined for each word x as the number of steps in a minimal G-derivation of x. It is shown that derivations may always be speeded up by any constant factor n, in the sense that for each positive integer n, an equi...

متن کامل

Normal Proofs and Their Grammar

We present grammatical (or equational) descriptions of the set of normal inhabitants fM j ` M : A; M in -normal form g of a given type A under a given basis , both for the standard simple type system (in partial discharge convention) and for the system in total discharge convention (or Prawitz-style natural deduction system). It is shown that in the latter system we can describe the set by a ( ...

متن کامل

A shape grammar interpreter for rectilinear forms

Shape grammars play an important role in a new generation of tools for the analysis and design of products. Up until now there has been numerous attempts to create a general shape grammar interpreter, but most of the existing tools are either very specific in their purpose, have only limited functionality or were programmed for one operating system. In this work we present a tool named Shape Gr...

متن کامل

Completeness of Context-Free Grammar Forms

The notions of a grammar form and g-interpretation were first introduced in [2]. However, it quickly became apparent, particularly for EOL forms [5], that (strict) interpretations had a wider interest as well as being better motivated mathematically. The study of parsing of grammar forms detailed in [4], the basic investigation in [8] on linear completeness amongst other results, the study of d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1973

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(73)90659-1